Improved Genetic Algorithm Integrated with Scheduling Rules for Flexible Job Shop Scheduling Problems
نویسندگان
چکیده
منابع مشابه
Flexible Job-Shop Scheduling Problems
Planning and scheduling problems in various industrial environments are combinatorial and very difficult. Generally, it is extremely hard to solve these types of problems in their general form. Scheduling can be formulated as a problem of determining the best sequence to execute a set of tasks on a set of resources, respecting specific constraints like precedence or disjunctive constraints (Car...
متن کاملAn improved Genetic Algorithm of Bi-level Coding for Flexible Job Shop Scheduling Problems
The current study presents an improved genetic algorithm(GA) for the flexible job shop scheduling problem (FJSP). The coding is divided into working sequence level and machine level and two effective crossover operators and mutation operators are designed for the generation and reduce the disruptive effects of genetic operators. The algorithm is tested on instances of 10 working sequences and 1...
متن کاملA Genetic Algorithm for Flexible Job-Shop Scheduling
— Flexible Job Shop scheduling problem (FJSSP) is an important scheduling problem which has received considerable importance in the manufacturing domain. In this paper a genetic algorithm (GA) based scheduler is presented for flexible job shop problem to minimise makespan. The proposed approach implements a domain independent GA to solve this important class of problem. The scheduler is impleme...
متن کاملGenetic algorithm for the flexible job-shop scheduling problem
In this paper, we propose a new optimization technique, the hierarchical multi-space competitive distributed genetic algorithm (HmcDGA), which is effective for the hierarchical optimization problem. It is an extension of the multi-space competitive distributed genetic algorithm (mcDGA), which was proposed by the authors. The mcDGA efficiently finds an optimal solution with a low computational c...
متن کاملGenetic Algorithms for Job-Shop Scheduling Problems
The n×m minimum-makespan general job-shop scheduling problem, hereafter referred to as the JSSP, can be described by a set of n jobs {Ji}1≤j≤n which is to be processed on a set of m machines {Mr}1≤r≤m. Each job has a technological sequence of machines to be processed. The processing of job Jj on machine Mr is called the operation Ojr. Operation Ojr requires the exclusive use of Mr for an uninte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: E3S Web of Conferences
سال: 2021
ISSN: 2267-1242
DOI: 10.1051/e3sconf/202124302010